Automatic Feature Construction and Optimization for General Game Player

نویسندگان

  • Tomoyuki KANEKO
  • Kazunori YAMAGUCHI
  • Satoru KAWAI
چکیده

In this paper, we describe our method that automatically constructs evaluation functions without any human analysis of a target game. Such automated constriction of evaluation functions is crucial to develop a general game player that can learn and play an arbitrary instance of a certain class of games. Our approach is to construct features written in logic programs from the game definition and translate them into specialized evaluator in order to get such efficiency that learning methods can try and test so many features that it produces accurate evaluation functions. We also introduced the decomposition of logical features called thin features in order to improve both accuracy and efficiency. Experiments on Othello endgames show that the accuracy and efficiency of evaluation functions generated by our method are approaching to those of the patten based evaluation function which is the state-of-the-art technique. keywords: automatic feature construction, logical feature

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Automatic Heuristic Construction in a Complete General Game Player

Computer game players are typically designed to play a single game: today’s best chess-playing programs cannot play checkers, or even tic-tac-toe. General Game Playing is the problem of designing an agent capable of playing many different previously unseen games. The first AAAI General Game Playing Competition was held at AAAI 2005 in order to promote research in this area. In this article, we ...

متن کامل

Multi Responses Optimization Through Game Theory Approach

In this paper, a new approach based on game theory has been proposed to multi responses problem optimization. Game theory is a useful tool for decision making in the conflict of interests between intelligent players in order to select the best joint strategy for them through selecting the best joint desirability. Present research uses the game theory approach via definition of each response as ...

متن کامل

In Proceedings of the Twenty - First National Conference on Artificial Intelligence ( AAAI - 06 ) , Boston , MA , July 2006 . Automatic Heuristic Construction in a Complete General Game Player ∗

Computer game players are typically designed to play a single game: today’s best chess-playing programs cannot play checkers, or even tic-tac-toe. General Game Playing is the problem of designing an agent capable of playing many different previously unseen games. The first AAAI General Game Playing Competition was held at AAAI 2005 in order to promote research in this area. In this article, we ...

متن کامل

SWITCHING TEAMS ALGORITHM FOR SIZING OPTIMIZATION OF TRUSS STRUCTURES

Meta-heuristics have received increasing attention in recent years. The present article introduces a novel method in such a class that distinguishes a number of artificial search agents called players within two teams. At each iteration, the active player concerns some other players in both teams to construct its special movements and to get more score. At the end of some iterations (like quart...

متن کامل

طراحی و اجرای یک سرویس Game GIS برای مدیریت بحران زمین‌لرزه مطالعه‌ی موردی: منطقه‌ی 10 تبریز

The term "Game GIS” implies to real spatially enabled games in which a special part of the world is virtually simulated, represented and managed. In fact, game GIS is an integrated system consists of video games and geographical information systems, aimed to simulate and representing spatially enabled environment. The achieved result of implementing a game GIS service can be exploite...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2001